Randomness in Distribution Protocols 1 Randomness in Distribution Protocols
نویسندگان
چکیده
Randomness is a useful computation resource due to its ability to enhance the capabilities of other resources. Its interaction with resources such as time, space, interaction with provers and its role in several areas of computer science has been extensively studied. In this paper we give a systematic analysis of the amount of randomness needed by secret sharing schemes and secure key distribution schemes. We give both upper and lower bounds on the number of random bits needed by secret sharing schemes. The bounds are tight for several classes of secret sharing schemes. For secure key distribution schemes we provide a lower bound on the amount of randomness needed, thus showing the optimality of a recently proposed key distribution protocol. Index terms : Randomness, Entropy, Secret Sharing, Key Distribution, Protocols, Cryptography, and Data Security.
منابع مشابه
A Decentralized Online Sortition Protocol
We propose a new online sortition protocol which is decentralized. We argue that our protocol has safety, fairness, randomness, non-reputation and openness properties. Sortition is a process that makes random decision and it is used in competitions and lotteries to determine who is the winner. In the real world, sortition is simply done using a lottery machine and all the participa...
متن کاملTESTING FOR “RANDOMNESS” IN SPATIAL POINT PATTERNS, USING TEST STATISTICS BASED ON ONE-DIMENSIONAL INTER-EVENT DISTANCES
To test for “randomness” in spatial point patterns, we propose two test statistics that are obtained by “reducing” two-dimensional point patterns to the one-dimensional one. Also the exact and asymptotic distribution of these statistics are drawn.
متن کاملAbstract: Promising advances in the field of quantum computing indicate a growing threat to cryptographic protocols based on integer factorization
Promising advances in the field of quantum computing indicate a growing threat to cryptographic protocols based on integer factorization. To counter this threat, researchers have already designed and tested alternative protocols that do not rely on factorization. Quantum key distribution, a cryptographic mechanism that relies on the inherent randomness of quantum mechanics, serves not only as a...
متن کاملProposed New Quantum Cryptography System Using Quantum Description Techniques for Generated Curves
-The main goal of this paper is combining the curve security methods with quantum cryptography concepts in order to increase the capability of quantum cryptography methods that used for key distribution and increase the randomness for quantum cryptography protocols. This paper produced a new approach depend on the generate curve and descript this curve by using quantum cryptography concepts, th...
متن کاملDetection loophole attacks on semi-device-independent quantum and classical protocols
Semi-device-independent quantum protocols realize information tasks – e.g. secure key distribution, random access coding, and randomness generation – in a scenario where no assumption on the internal working of the devices used in the protocol is made, except their dimension. These protocols offer two main advantages: first, their implementation is often less demanding than fully-device-indepen...
متن کامل